A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers
نویسنده
چکیده
permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
منابع مشابه
A rate-distortion problem for a communication system with a secondary decoder to be hindered
permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. A&rucl-A rate-distortion problem is considered for a communication system (f, &) with a secondary decoder & to be hindered whi...
متن کاملSecret Key Agreement from Correlated Source Outputs Using Low Density Parity Check Matrices
This paper deals with a secret key agreement problem from correlated random numbers. It is proved that there is a pair of linear matrices that yields a secret key agreement in the situation wherein a sender, a legitimate receiver, and an eavesdropper have access to correlated random numbers. A relation between the coding problem of correlated sources and a secret key agreement problem from corr...
متن کاملAchievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملStrongly Secure Linear Network Coding
In a network with capacity h for multicast, information Xh = (X1, X2, · · · , Xh) can be transmitted from a source node to sink nodes without error by a linear network code. Furthermore, secret information S r = (S 1, S 2, · · · , S r) can be transmitted securely against wiretappers by k-secure network coding for k ≤ h−r. In this case, no information of the secret leaks out even if an adversary...
متن کاملConversion of Network Problem with Transfer Nodes, and Condition of Supplying the Demand of any Sink from the Particular Source to the Transportation Problem
In this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem. Towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 29 شماره
صفحات -
تاریخ انتشار 1983